منابع مشابه
Representing Permutations with Few Moves
Consider a finite sequence of permutations of the elements 1, . . . , n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i to be a maximal subsequence of at least two consecutive permutations during which its positions form an arithmetic progression of common difference +1 o...
متن کاملDrawing Permutations with Few Corners
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is decomposed into nearest-neighbour transpositions. We address the problem of minimizing the number of crossings together with the number of corners of the pat...
متن کاملRealizing Small Tournaments Through Few Permutations
Every tournament on 7 vertices is the majority relation of a 3-permutation profile, and there exist tournaments on 8 vertices that do not have this property. Furthermore every tournament on 8 or 9 vertices is the majority relation of a 5-permutation profile.
متن کاملRepresenting permutations without permutations, or the expressive power of sequence types
We show that every (finite or not) typing derivation of system M, using non-idempotent intersection, which is the infinitary version of de Carvalho’s system M0, can be represented in a rigid, non-idempotent intersection type system S. Namely, whereas non-idempotent intersection is represented by multisets in system M, system S resort to families of types indexed by integers, called tracks. The ...
متن کاملThe Action of a Few Permutations on r - tuples isQuickly
We prove that for every r and d 2 there is a C such that for most choices of d permutations 1; 2; : : : ; d of Sn, the following holds: for any two r-tuples of distinct elements in f1; : : : ; ng, there is a product of less than C log n of the i's which map the rst r-tuple to the second. Although we came across this problem while studying a rather unrelated cryptographic problem, it belongs to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2016
ISSN: 0895-4801,1095-7146
DOI: 10.1137/15m1036105